On the local convergence study for an efficient k-step iterative method

An efficient three-step iterative method with sixth-order convergence for solving nonlinear equations

The aim of this paper is to construct an e¢ cient iterative method to solve nonlinear equations. This method is obtained from M. Javidi’s method (Appl. Math. Comput. 193 (2007) 360-365), which is third-order. The convergence order of new method is established to six and the e¢ ciency index is 1.5651. The Proposed method is compared with the second, third and sixth order methods. Some numerical ...

On the Convergence for an Iterative Method for Quasivariational Inclusions

On the Maximal Degree of the K-Step Obrechkoff’s Method

Local Convergence of an Efficient High Convergence Order Method Using Hypothesis Only on the First Derivative

We present a local convergence analysis of an eighth order three step method in order to approximate a locally unique solution of nonlinear equation in a Banach space setting. In an earlier study by Sharma and Arora (2015), the order of convergence was shown using Taylor series expansions and hypotheses up to the fourth order derivative or even higher of the function involved which restrict the...

AN ITERATIVE METHOD WITH SIX-ORDER CONVERGENCE FOR SOLVING NONLINEAR EQUATIONS

Modification of Newtons method with higher-order convergence is presented. The modification of Newtons method is based on Frontinis three-order method. The new method requires two-step per iteration. Analysis of convergence demonstrates that the order of convergence is 6. Some numerical examples illustrate that the algorithm is more efficient and performs better than classical Newtons method and ...